An Algebraic Approach for Compiling Real-Time Programs
نویسندگان
چکیده
منابع مشابه
An algebraic approach for PLC programs verification
This article presents a verification based on a specific Boolean algebra, called , and symbolic reasoning on equations defined in this algebra. The formal definition of this algebra enables to model binary signals that include variables states, events, as well as physical delays between events. The behavior of the generic function blocks of the IEC 61131 standard as well as of PLC programs usin...
متن کاملCompiling Java for Real-Time Systems Compiling Java for Real-Time Systems
Our everyday appliances ranging from toys to vehicles, as well as the equipment used to manufacture them, contain an increasing number of embedded computers. Embedded software often implement functionality that is crucial for the operation of the device, resulting in a variety of timing requirements and resource utilization constraints to be fulfilled. Industrial competition and the ever increa...
متن کاملA New Approach to Compiling Adaptive Programs
An adaptive program can be understood as an object-oriented program where the class graph is a parameter, and hence the class graph may be changed without changing the program. The problem of compiling an adaptive program and a class graph into an object-oriented program was studied by Palsberg, Xiao, and Lieberherr in 1995. Their compiler is efficient but works only in special cases. In this p...
متن کاملAn Algebraic Theory of Distributed Real-Time
This paper develops a real-time process algebra, TPLmc, for modeling and reasoning about distributed real-time systems. Like the algebra PMC, TPLmc includes operators for binding processes to di erent clocks; unlike PMC, however, TPLmc includes a version of the maximal progress assumption. Using simple examples, we motivate why these features are useful and in some cases necessary for modeling ...
متن کاملCompiling Real-Time Programs with Timing Constraint Re nement and Structural Code Motion
We present a programming language called TCEL (Time-Constrained Event Language), whose semantics is based on time-constrained relationships between observable events. Such a semantics infers only those timing constraints necessary to achieve real-time correctness, without over-constraining the system. Moreover, an optimizing compiler can exploit this looser semantics to help tune the code, so t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80517-6